A note on a fixed-point method for deconvolution

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Note on a Fixed Point Method for Deconvolution

In this paper we study a particular multidimensional deconvolution problem. The distribution of the noise is assumed to be of the form G(dx) = (1− α)δ(dx) + αg(x)dx, where δ is the Dirac mass at 0 ∈ Rd, g : Rd → [0,∞) is a density and α ∈ [0, 1 2 [. We propose a new minimax estimation procedure, which is not based on a Fourier approach, but on a fixed point method. The performances of the proce...

متن کامل

A Note on Equivariant Fixed Point Theory

be found in all classical books on the subject (for example in [4, 44]). For every x ∈ X the isotropy subgroup (also termed fixer or stabilizer) of x is Gx = {g ∈ G : gx = x}. If H ⊂ G is a subgroup of G, then the space fixed by H in X is X = {x ∈ X : Hx = x} = {x ∈ X : H ⊂ Gx}. If X and Y are G-spaces, then a G-map (i.e. an equivariant map) f : X → Y is a map which commutes with the G-action: ...

متن کامل

A Note on Fixed Point Theorem for Fuzzy Mappings

The notion of fuzzy sets 6 relates to objects with unsharp boundaries and the degrees of membership plays a crucial role in describing them. In case of fuzzy sets, we allow the truths of propositions to be expressed in terms of degrees which offers a considerably broader framework for knowledge representation while dealing with uncertainty. In his paper , Heilpern introduced the concept of a fu...

متن کامل

A note on negative tagging for least fixed-point formulae

We consider proof systems with sequents of the form U for proving validity of a propositional modal calculus formula over a set U of states in a given model Such proof systems usually handle xed point formulae through unfolding thus allowing such formulae to reappear in a proof Tagging is a technique originated by Winskel for annotating xed point formulae with information about the proof states...

متن کامل

A Common Fixed Point Theorem Using an Iterative Method

Let $ H$ be a Hilbert space and $C$ be a closed, convex and nonempty subset of $H$. Let $T:C rightarrow H$ be a non-self and non-expansive mapping. V. Colao and G. Marino with particular choice of the sequence  ${alpha_{n}}$ in Krasonselskii-Mann algorithm, ${x}_{n+1}={alpha}_{n}{x}_{n}+(1-{alpha}_{n})T({x}_{n}),$ proved both weak and strong converging results. In this paper, we generalize thei...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Statistics

سال: 2016

ISSN: 0233-1888,1029-4910

DOI: 10.1080/02331888.2016.1265967